Published in: LIPIcs, Volume 263, 37th European Conference on Object-Oriented Programming (ECOOP 2023)
Sarah Harris, Simon Cooksey, Michael Vollmer, and Mark Batty. Rust for Morello: Always-On Memory Safety, Even in Unsafe Code (Experience Paper). In 37th European Conference on Object-Oriented Programming (ECOOP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 263, pp. 39:1-39:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{harris_et_al:LIPIcs.ECOOP.2023.39, author = {Harris, Sarah and Cooksey, Simon and Vollmer, Michael and Batty, Mark}, title = {{Rust for Morello: Always-On Memory Safety, Even in Unsafe Code}}, booktitle = {37th European Conference on Object-Oriented Programming (ECOOP 2023)}, pages = {39:1--39:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-281-5}, ISSN = {1868-8969}, year = {2023}, volume = {263}, editor = {Ali, Karim and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2023.39}, URN = {urn:nbn:de:0030-drops-182322}, doi = {10.4230/LIPIcs.ECOOP.2023.39}, annote = {Keywords: Compilers, Rust, Memory Safety, CHERI} }
Published in: DARTS, Volume 9, Issue 2, Special Issue of the 37th European Conference on Object-Oriented Programming (ECOOP 2023)
Sarah Harris, Simon Cooksey, Michael Vollmer, and Mark Batty. Rust for Morello: Always-On Memory Safety, Even in Unsafe Code (Artifact). In Special Issue of the 37th European Conference on Object-Oriented Programming (ECOOP 2023). Dagstuhl Artifacts Series (DARTS), Volume 9, Issue 2, pp. 25:1-25:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{harris_et_al:DARTS.9.2.25, author = {Harris, Sarah and Cooksey, Simon and Vollmer, Michael and Batty, Mark}, title = {{Rust for Morello: Always-On Memory Safety, Even in Unsafe Code (Artifact)}}, pages = {25:1--25:2}, journal = {Dagstuhl Artifacts Series}, ISSN = {2509-8195}, year = {2023}, volume = {9}, number = {2}, editor = {Harris, Sarah and Cooksey, Simon and Vollmer, Michael and Batty, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DARTS.9.2.25}, URN = {urn:nbn:de:0030-drops-182650}, doi = {10.4230/DARTS.9.2.25}, annote = {Keywords: Compilers, Rust, Memory Safety, CHERI} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Ignaz Rutter, Darren Strash, Peter Stumpf, and Michael Vollmer. Simultaneous Representation of Proper and Unit Interval Graphs. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 80:1-80:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{rutter_et_al:LIPIcs.ESA.2019.80, author = {Rutter, Ignaz and Strash, Darren and Stumpf, Peter and Vollmer, Michael}, title = {{Simultaneous Representation of Proper and Unit Interval Graphs}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {80:1--80:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.80}, URN = {urn:nbn:de:0030-drops-112013}, doi = {10.4230/LIPIcs.ESA.2019.80}, annote = {Keywords: Intersection Graphs, Recognition Algorithm, Proper/Unit Interval Graphs, Simultaneous Representations} }
Published in: LIPIcs, Volume 74, 31st European Conference on Object-Oriented Programming (ECOOP 2017)
Michael Vollmer, Sarah Spall, Buddhika Chamith, Laith Sakka, Chaitanya Koparkar, Milind Kulkarni, Sam Tobin-Hochstadt, and Ryan R. Newton. Compiling Tree Transforms to Operate on Packed Representations. In 31st European Conference on Object-Oriented Programming (ECOOP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 74, pp. 26:1-26:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{vollmer_et_al:LIPIcs.ECOOP.2017.26, author = {Vollmer, Michael and Spall, Sarah and Chamith, Buddhika and Sakka, Laith and Koparkar, Chaitanya and Kulkarni, Milind and Tobin-Hochstadt, Sam and Newton, Ryan R.}, title = {{Compiling Tree Transforms to Operate on Packed Representations}}, booktitle = {31st European Conference on Object-Oriented Programming (ECOOP 2017)}, pages = {26:1--26:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-035-4}, ISSN = {1868-8969}, year = {2017}, volume = {74}, editor = {M\"{u}ller, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2017.26}, URN = {urn:nbn:de:0030-drops-72737}, doi = {10.4230/LIPIcs.ECOOP.2017.26}, annote = {Keywords: compiler optimization, program transformation, tree traversal} }
Feedback for Dagstuhl Publishing